0.00/0.01	% File    : /export/starexec/sandbox2/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : appext
0.00/0.01	% Variant    : fo
0.00/0.01	% Ordering    : rpo6
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-ho \
0.00/0.01	  --no-avatar \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2 \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n106.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.21	% CPULimit   : 300
0.00/0.21	% DateTime   : Fri Feb  2 15:46:09 CST 2018
0.00/0.23	% done 1 iterations in 0.002s
0.00/0.23	% SZS status Theorem for 'stdin'
0.00/0.23	% SZS output start Refutation
0.00/0.23	tff(zf_stmt_4, conjecture,
0.00/0.23	  (?[X]: (app_encode_app($i,$o,cP,X) => (![Y]: app_encode_app($i,$o,cP,Y))))).
0.00/0.23	tff(zf_stmt_0, negated_conjecture,
0.00/0.23	  (~
0.00/0.23	    (?[X]: (app_encode_app($i,$o,cP,X) => (![Y]: app_encode_app($i,$o,cP,Y)))))).
0.00/0.23	tff('0', plain, ~ app_encode_app($i, $o, cP, sk_Y),
0.00/0.23	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.23	tff('1', plain, ![X4]: app_encode_app($i, $o, cP, X4),
0.00/0.23	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.23	tff('2', plain, ~ $true, inference('demod', [status(thm)], ['0', '1'])).
0.00/0.23	tff('3', plain, $false, inference('simplify', [status(thm)], ['2'])).
0.00/0.23	
0.00/0.23	% SZS output end Refutation
0.00/0.23	EOF
